Braid is undecidable
نویسنده
چکیده
Braid is a 2008 puzzle game centered around the ability to reverse time. We show that Braid can simulate an arbitrary computation. Our construction makes no use of Braid’s unique time mechanics, and therefore may apply to many other video games. We also show that a plausible “bounded” variant of Braid lies within 2-EXPSPACE. Our proof relies on a technical lemma about Turing machines which may be of independent interest. Namely, define a braidlike Turing machine to be a Turing machine that, when it writes to the tape, deletes all data on the tape to the right of the head. We prove that deciding the behavior of such a machine lies in EXPSPACE.
منابع مشابه
The Hurwitz Equivalence Problem Is Undecidable
In this paper, we prove that the Hurwitz equivalence problem for 1-factorizations in F2⊕F2 is undecidable, and as a consequence, the Hurwitz equivalence problem for ∆-factorizations in the braid groups Bn, n ≥ 5 is also undecidable.
متن کاملDecidable classes of documents for XPath
We study the satisfiability problem for XPath over XML documents of bounded depth. We define two parameters, called match width and braid width, that assign a number to any class of documents. We show that for all k, satisfiability for XPath restricted to bounded depth documents with match width at most k is decidable; and that XPath is undecidable on any class of documents with unbounded braid...
متن کاملWeighted Automata on Infinite Words in the Context of Attacker-Defender Games
The paper is devoted to several infinite-state Attacker-Defender games with reachability objectives. We prove the undecidability of checking for the existence of a winning strategy in several low-dimensional mathematical games including vector reachability games, word games and braid games. To prove these results, we consider a model of weighted automata operating on infinite words and prove th...
متن کاملComposition problems for braids: Membership, Identity and Freeness
In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with three strands, B3, have polynomial time solutions we prove that a very natural question for braid composition, the membership problem, is NP-complete for braids with only three strands. The membership problem is decidable in NP for B3, but it...
متن کاملComposition Problems for Braids
In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with 3 strands, B3, have polynomial time solutions we prove that a very natural question for braid composition, the membership problem, is NP-hard for braids with only 3 strands. The membership problem is decidable for B3, but it becomes harder fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1412.0784 شماره
صفحات -
تاریخ انتشار 2014